Finite groups in which normality, permutability or Sylow permutability is transitive

نویسنده

  • Izabela Agata Malinowska
چکیده

Y. Li gave a characterization of the class of finite soluble groups in which every subnormal subgroup is normal by means of NE -subgroups: a subgroup H of a group G is called an NE -subgroup of G if NG(H) ∩ H = H. We obtain a new characterization of these groups related to the local Wielandt subgroup. We also give characterizations of the classes of finite soluble groups in which every subnormal subgroup is permutable or Sylow permutable in terms of NE -subgroups.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Classification of finite groups with toroidal or projective-planar permutability graphs

Let G be a group. The permutability graph of subgroups of G, denoted by Γ(G), is a graph having all the proper subgroups of G as its vertices, and two subgroups are adjacent in Γ(G) if and only if they permute. In this paper, we classify the finite groups whose permutability graphs are toroidal or projective-planar. In addition, we classify the finite groups whose permutability graph does not c...

متن کامل

On the subgroup permutability degree of some finite simple groups

Consider a finite group G and subgroups H,K of G. We say that H and K permute if HK = KH and call H a permutable subgroup if H permutes with every subgroup of G. A group G is called quasi-Dedekind if all subgroups of G are permutable. We can define, for every finite group G, an arithmetic quantity that measures the probability that two subgroups (chosen uniformly at random with replacement) per...

متن کامل

Permutable fuzzy consequence and interior operators and their connection with fuzzy relations

Fuzzy operators are an essential tool in many fields and the operation of composition is often needed. In general, composition is not a commutative operation. However, it is very useful to have operators for which the order of composition does not affect the result. In this paper, we analyze when permutability appears. That is, when the order of application of the operators does not change the ...

متن کامل

ON FINITE GROUPS IN WHICH SS-SEMIPERMUTABILITY IS A TRANSITIVE RELATION

Let H be a subgroup of a finite group G. We say that H is SS-semipermutable in Gif H has a supplement K in G such that H permutes with every Sylow subgroup X of Kwith (jXj; jHj) = 1. In this paper, the Structure of SS-semipermutable subgroups, and finitegroups in which SS-semipermutability is a transitive relation are described. It is shown thata finite solvable group G is a PST-group if and on...

متن کامل

Derivations and the Permutability of Subgroups in Polycyclic-by-finite Groups

It is shown that there is an algorithm to decide if two given subgroups of a polycyclic-by-finite group permute. This is accomplished by finding an algorithm which is able to determine if a derivation is surjective.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014